1. Some common normal forms include conjunctive normal form and disjunctive normal form . 2. This is a special form of disjunctive normal form . 3. Any propositional formula can be reduced to its conjunctive or disjunctive normal form . 4. When in this form the formula is said to be in disjunctive normal form . 5. This allows us to write the restricted function as a small formula in disjunctive normal form . 6. The conditional part of the rule can be a simple or compound expression specified in either conjunctive or disjunctive normal form . 7. Gilmore's program used conversion to disjunctive normal form , a form in which the satisfiability of a formula is obvious. 8. Any particular Boolean function can be represented by one and only one full disjunctive normal form , one of the canonical forms. 9. As in the disjunctive normal form ( DNF ), the only propositional connectives a formula in CNF can contain are predicate symbol. 10. :Testing tautology of formulas in disjunctive normal form can be reduced to testing Talk 10 : 24, 10 March 2007 ( UTC)
Mobile